Optimization based on the minimum maximal k-partial-matching problem of finite states machines with input multiplexing

Abstract Finite State Machines with Input Multiplexing (FSMIMs) were proposed in previous work as a technique for efficient mapping (FSMs) into ROM memory. In this paper, we present new contributions to the optimization process involved implementation of FSMIMs Field Programmable Gate Array (FPGA) devices. This consists two stages: (1) simplification bank input selectors FSMIM, and (2) reduction depth ROM. has significant impact both on number used Look-Up Tables (LUTs) Embedded Memory Blocks (EMBs) required by For first stage, approaches optimize FSMIM implementations based Minimum Maximal k -Partial Matching (MMKPM) problem: one them applies greedy algorithm MMKPM problem, other multiobjetive variant its corresponding Integer Linear Programing formulation. We also propose modification second which characteristics EMBs are taken account improve results. The significantly reduces FPGA resources respect one. addition, achieve an adequate trade-off between usage LUTs conventional FSM those LUT.